A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

This paper provides an extensive review of the popular multi-objective optimization algorithm NSGA-II for selected combinatorial problems viz. assignment problem, allocation travelling salesman vehicle routing scheduling and knapsack problem. It is identified that based on manner in which has been implemented solving aforementioned group problems, there can be three categories: Conventional NSGA-II, where authors have basic version without making any changes operators; second one Modified researchers after some into it finally, Hybrid variants, hybridized conventional modified with other technique. The article analyses modifications also discusses various performance assessment techniques used by researchers, i.e., test instances, metrics, statistical tests, case studies, benchmarking state-of-the-art algorithms. Additionally, a brief bibliometric analysis work done this study.